Theoretical computer science

Results: 9916



#Item
571Formal methods / Theoretical computer science / Failure / Materials science / Reliability engineering / Survival analysis / DO-178B / Exception handling / Formal verification / Software development process / KeY / Software development

Formal Safety Certification of Auto-Generated Aerospace Software Ewen Denney and Bernd Fischer {edenney,fisch}@email.arc.nasa.gov USRA/RIACS, NASA Ames Research Center, Moffett Field, CA 94035, USA Code generators can ad

Add to Reading List

Source URL: ti.arc.nasa.gov

Language: English
572Edsger W. Dijkstra / Motion planning / Theoretical computer science / Robot / Mobile robot / Shortest path problem / Emerging technologies / Self-reconfiguring modular robot

The Optimism Principle: A Unified Framework for Optimal Robotic Network Deployment in An Unknown Obstructed Environment Shangxing Wang1 , Bhaskar Krishnamachari1 and Nora Ayanian2 Abstract— We consider the problem of d

Add to Reading List

Source URL: anrg.usc.edu

Language: English - Date: 2015-08-18 02:29:19
573Theoretical computer science / Operations research / Mathematical optimization / Combinatorial optimization / Hungarian algorithm / Harold W. Kuhn / Discrete optimization / Algorithm / Carl Gustav Jacob Jacobi

123 Documenta Math. Discrete Optimization Stories

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-07-25 10:24:49
574Recursion / Subroutines / Method / Object-oriented programming / Theoretical computer science / Tree traversal / Mutual recursion / Inline expansion / Visitor pattern / Multiple dispatch / Generic function / Generic programming

Functional Adaptive Programming A dissertation presented by Bryan Chadwick

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2010-10-28 11:25:00
575Knowledge representation / Reasoning / Computational topology / Constraint programming / Region connection calculus / Theoretical computer science / FO / Rough set / Spatialtemporal reasoning

Rough Sets in Approximate Spatial Reasoning Thomas Bittner and John G. Stell Centre de recherche en geomatique, Laval University, Quebec, Canada.  Department of Computer Science, Keele Unive

Add to Reading List

Source URL: www.acsu.buffalo.edu

Language: English - Date: 2004-06-10 06:15:20
576Theoretical computer science / Formal methods / Integrated circuits / Logic in computer science / Computer memory / Formal verification / Waypoint / Debugging / Application-specific integrated circuit / Dynamic random-access memory / Error / Model checking

Microsoft Word - Post-Silicon Debug__30__group__.doc

Add to Reading List

Source URL: www.deshawresearch.com

Language: English - Date: 2010-09-27 16:06:45
577Boolean algebra / Formal methods / Theoretical computer science / Implicant / Disjunctive normal form / IP / Lambda calculus / Vector space / Boolean satisfiability problem / Bayesian network

RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

Add to Reading List

Source URL: aml.media.mit.edu

Language: English - Date: 2011-07-13 14:33:31
578Formal methods / Logic in computer science / Theoretical computer science / Systems engineering / Formal verification / Model checking / Satisfiability modulo theories / Verification / Correctness / Software verification

A Tool Bus for Anytime Verification? Natarajan Shankar1 Computer Science Laboratory SRI International Menlo Park CAUSA

Add to Reading List

Source URL: fm.csl.sri.com

Language: English - Date: 2010-11-11 10:23:46
579Mathematical logic / Operations research / Algorithm / Theoretical computer science / Axiom / Logic programming / Euclidean geometry / Datalog / Mathematical optimization / Constraint satisfaction / Satisfiability modulo theories / Foundations of geometry

Solving Geometry Problems using a Combination of Symbolic and Numerical Reasoning Shachar Itzhaky1 , Sumit Gulwani2 , Neil Immerman3 , and Mooly Sagiv1 1

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English
580Algorithm / Mathematical logic / Theoretical computer science / Edsger W. Dijkstra / Spanning tree / Graphical models

Exercise 2: Flirting with Synchrony and Asynchrony Task 1: Growing Balls Denote by B(v, r) the ball of radius r around v, i.e., B(v, r) = {u ∈ V : dist(u, v) ≤ r}. Consider the following partitioning algorithm. Algor

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-10-28 15:42:59
UPDATE